All-to-all broadcast problem of some classes of graphs under the half duplex all-port model
نویسندگان
چکیده
منابع مشابه
Pipelined All-to-All Broadcast in All-Port Meshes and Tori
ÐAll-to-all communication is one of the most dense communication patterns and occurs in many important applications in parallel computing. In this paper, we present a new all-to-all broadcast algorithm in all-port meshes and tori. The algorithm utilizes a controlled message flooding based on a novel broadcast pattern, which ensures a balanced traffic load in all dimensions in the network so tha...
متن کاملEfficient All-to-All Broadcast in All-Port Mesh and Torus Networks
All-to-all communication is one of the most dense communication patterns and occurs in many important applications in parallel computing. In this paper, we present a new all-toall broadcast algorithm in all-port mesh and torus networks. Unlike existing all-to-all broadcast algorithms, the new algorithm takes advantage of overlapping of message switching time and transmission time, and achieves ...
متن کاملOptimal All-to-All Personalized Communication in All-Port Tori
All-to-all personalized communication, also known as complete exchange, is one of the most dense communication patterns in parallel computing. In this paper, we propose new indirect algorithms for complete exchange on all-port ring and torus. The new algorithms fully utilize all communication links and transmit messages along shortest paths to completely achieve the theoretical lower bounds on ...
متن کاملEfficient Data Broadcast Using One-To-All and All-To-All Broadcast Algorithm In Wireless Networks
Broadcast communication is a key requirement for WSNs Broadcast communication, which forms the basis of all communication in wireless networks. In multihop wireless networks, however, interference at a node due to simultaneous transmissions from its neighbors makes it important to design a minimumlatency broadcast algorithm, which is known to be NPcomplete. A simple 12-approximation algorithm f...
متن کاملAll Ramsey (2K2,C4)−Minimal Graphs
Let F, G and H be non-empty graphs. The notation F → (G,H) means that if any edge of F is colored by red or blue, then either the red subgraph of F con- tains a graph G or the blue subgraph of F contains a graph H. A graph F (without isolated vertices) is called a Ramsey (G,H)−minimal if F → (G,H) and for every e ∈ E(F), (F − e) 9 (G,H). The set of all Ramsey (G,H)−minimal graphs is denoted by ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2014
ISSN: 0166-218X
DOI: 10.1016/j.dam.2014.03.014